Optimal multi-degree reduction of triangular Bézier surfaces with corners continuity in the norm L2
نویسندگان
چکیده
This paper derives an approximation algorithm for multi-degree reduction of a degree n triangular Bézier surface with corners continuity in the normL2. The new idea is to use orthonormality of triangular Jacobi polynomials and the transformation relationship between bivariate Jacobi and Bernstein polynomials. This algorithm has a very simple and explicit expression in matrix form, i.e., the reduced matrix depends only on the degrees of the surfaces before and after degree reduction. And the approximation error of this degree-reduced surface is minimum and can get a precise expression before processing of degree reduction. Combined with surface subdivision, the piecewise degree-reduced patches possess global C0 continuity. Finally several numerical examples are presented to validate the effectiveness of this algorithm. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Multi-degree reduction of triangular Bézier surfaces with boundary constraints
Given a triangular Bézier surface of degree n, the problem of multi-degree reduction by a triangular Bézier surface of degree m with boundary constraints is investigated. This paper considers the continuity of triangular Bézier surfaces at the three corners, so that the boundary curves preserve endpoints continuity of any order α. The l2and L2-norm combined with the constrained least-squares me...
متن کاملDegree Reduction of Triangular Bézier Surfaces with C-Vertices
The issue of Cα-degree reduction of triangular Bézier surfaces is exposed. It is anticipated that both triangular Bézier surfaces are Cα-continuous at the vertices. The Euclidean norm as well as the L2−norm is used. The final solutions are given in terms of the matrix of degree raising, the Gram matrix, and the Bézier points. Moreover, it is shown that the solutions using both norms are equival...
متن کاملOptimal constrained multi-degree reduction of Bézier curves with explicit expressions based on divide and conquer
We decompose the problem of the optimal multi-degree reduction of Bézier curves with corners constraint into two simpler subproblems, namely making high order interpolations at the two endpoints without degree reduction, and doing optimal degree reduction without making high order interpolations at the two endpoints. Further, we convert the second subproblem into multi-degree reduction of Jacob...
متن کاملWeighted G-Multi-Degree Reduction of Bézier Curves
In this paper, weighted G-multi-degree reduction of Bézier curves is considered. The degree reduction of a given Bézier curve of degree n is used to write it as a Bézier curve of degree m,m < n. Exact degree reduction is not possible, and, therefore, approximation methods are used. The weight function w(t) = 2t(1 − t), t ∈ [0, 1] is used with the L2-norm in multidegree reduction with G-continui...
متن کاملPii: S0167-8396(02)00093-6
Given a Bézier curve of degree n, the problem of optimal multi-degree reduction (degree reduction of more than one degree) by a Bézier curve of degreem (m< n−1) with constraints of endpoints continuity is investigated. With respect to L2 norm, this paper presents one approximate method (MDR by L2) that gives an explicit solution to deal with it. The method has good properties of endpoints inter...
متن کامل